Minimal volume entropy for graphs
نویسندگان
چکیده
منابع مشابه
Minimal Volume Entropy on Graphs
Among the normalized metrics on a graph, we show the existence and the uniqueness of an entropy-minimizing metric, and give explicit formulas for the minimal volume entropy and the metric realizing it. Parmi les distances normalisées sur un graphe, nous montrons l’existence et l’unicité d’une distance qui minimise l’entropie, et nous donnons des formules explicites pour l’entropie volumique min...
متن کاملMaximum volume simplices and trace-minimal graphs
Let (v, δ) be the set of all δ-regular graphs on v vertices. A graphG ∈ (v, δ) is trace-minimal in (v, δ) if the vector whose ith entry is the trace of the ith power of the adjacency matrix of G, is minimum under the lexicographic order among all such vectors corresponding to graphs in (v, δ). We consider the problem of maximizing the volume of an n-dimensional simplex consisting of n + 1 verti...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملminimal, vertex minimal and commonality minimal cn-dominating graphs
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
متن کاملAsymptotic Relations Between Minimal Graphs and α-entropy
This report is concerned with power-weighted weight functionals associated with a minimal graph spanning a random sample of n points from a general multivariate Lebesgue density f over [0, 1]. It is known that under broad conditions, when the functional applies power exponent γ ∈ (1, d) to the graph edge lengths, the log of the functional normalized by n(d−γ)/d is a strongly consistent estimato...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2008
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-08-04227-x